Provable-Security of Public-Key Encryption Schemes
نویسنده
چکیده
Intuition. Suppose that your lecturer writes the number 25927 on the board and asks everyone in the class for its prime factorisation. Immediately Alice, who is incidentally a friend of the lecturer, shouts 11 × 2357. What conclusion can be drawn from this? Can we conclude that Alice is very good at factoring integers? It might haven been the case that Alice’s favourite primes are 11 and 2357 and hence she recognises 25927 as their product. To test Alice further we need to give her a few more tests. Furthermore, these tests should be in some sense random so they are unpredictable to Alice (hence she couldn’t have prepared for them beforehand). Moreover, we need to check that alice does not take too long (i.e. she is “efficient”) as we give her larger and larger numbers and that she does not make too many mistakes (i.e. her answer is incorrect “infrequently”).
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملOn Provable Security of Cryptographic Schemes
Provable security is an important issue in modern cryptography because it satisfies the security of the encryption schemes in a theoretical way via a reduction method. To prove the security of a cryptographic scheme, it is necessarry to define the goals and the capabilities of the adversary. In this paper, we explain security models in terms of the adversarial goals and the adversarial capabili...
متن کاملPublic Key Encryption Algorithm and the Random Oracle
Cryptographic theory has provided a potentially invaluable notion for cryptographic practice: the idea of provable security. Unfortunately, theoretical work often gains provable security only at the cost of effciency. Schemes like standard RSA are efficient but not provably secured. There are schemes who are provably secured but are not efficient. However, there are encryption schemes, for eg. ...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملBrowse searchable encryption schemes: Classification, methods and recent developments
With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this featur...
متن کاملPublic key encryption supporting plaintext equality test and user-specified authorization
In this paper, we investigate a category of public key encryption schemes that supports plaintext equality test and userspecified authorization. With this new primitive, two users, who possess their own public/private key pairs, can issue token(s) to a proxy to authorize it to perform plaintext equality test from their ciphertexts. We provide a formal formulation for this primitive and present ...
متن کامل